Improved Analysis of Highest-Degree Branching for Feedback Vertex Set
نویسندگان
چکیده
Recent empirical evaluations of exact algorithms for Feedback Vertex Set have demonstrated the efficiency a highest-degree branching algorithm with degree-based pruning. In this paper, we prove that empirically fast runs in $$O(3.460^k n)$$ time, where k is solution size. This improves previous best $$O(3.619^k -time deterministic obtained by Kociumaka and Pilipczuk (Inf Process Lett 114:556–560, 2014. https://doi.org/10.1016/j.ipl.2014.05.001 ).
منابع مشابه
An Improved Exact Algorithm for Undirected Feedback Vertex Set
A feedback vertex set in an undirected graph is a subset of vertices removal of which leaves a graph with no cycles. Razgon (SWAT 2006) gave a 1.8899n-time algorithm for finding a minimum feedback vertex set in an n-vertex undirected graph, which is the first exact algorithm for the problem that breaks the trivial barrier of 2. Later, Fomin et al. (Algorithmica 2008) improved the result to 1.75...
متن کاملImproved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set
In this paper we study the “independent” version of the classic Feedback Vertex Set problem in the realm of parameterized algorithms and moderately exponential time algorithms. More precisely, we study the Independent Feedback Vertex Set problem, where we are given an undirected graph G on n vertices and a positive integer k, and the objective is to check if there is an independent feedback ver...
متن کاملImproved Algorithms for the Feedback Vertex Set Problems
We present improved parameterized algorithms for the Feedback Vertex Set problem on both unweighted and weighted graphs. Both algorithms run in time O(5kn). The algorithms construct a feedback vertex set of size bounded by k (in the weighted case this set is of minimum weight among the feedback vertex set of size at most k) in a given graph G, or reports that no such a feedback vertex set exist...
متن کاملAn improved FPT algorithm for Independent Feedback Vertex Set
We study the Independent Feedback Vertex Set problem — a variant of the classic Feedback Vertex Set problem where, given a graph G and an integer k, the problem is to decide whether there exists a vertex set S ⊆ V (G) such that G \ S is a forest and S is an independent set of size at most k. We present an O∗((1 +φ))-time FPT algorithm for this problem, where φ < 1.619 is the golden ratio, impro...
متن کامل0333 - 3590 Improved Algorithms for the Feedback Vertex Set Problems
We present improved parameterized algorithms for the Feedback Vertex Set problem on both unweighted and weighted graphs. Both algorithms run in time O(5kn). For unweighted graphs, our algorithm either constructs a feedback vertex set of size bounded by k in a given graph G, or reports that no such a feedback vertex set exists in G. For weighted graphs, our algorithm either constructs a minimum-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2021
ISSN: ['1432-0541', '0178-4617']
DOI: https://doi.org/10.1007/s00453-021-00815-w